Max k-cut and the smallest eigenvalue
نویسنده
چکیده
Let G be a graph of order n and size m, and let mck (G) be the maximum size of a k-cut of G. It is shown that mck (G) k 1 k m μmin (G) n 2 , where μmin (G) is the smallest eigenvalue of the adjacency matrix of G. An infinite class of graphs forcing equality in this bound is constructed.
منابع مشابه
Bipartite Subgraphs And The Smallest Eigenvalue
Two results dealing with the relation between the smallest eigenvalue of a graph and its bipartite subgraphs are obtained. The first result is that the smallest eigenvalue μ of any non-bipartite graph on n vertices with diameter D and maximum degree ∆ satisfies μ > −∆ + 1 (D+1)n . This improves previous estimates and is tight up to a constant factor. The second result is the determination of th...
متن کاملFinding Sparse Cuts via Cheeger Inequalities for Higher Eigenvalues
Cheeger’s fundamental inequality states that any edge-weighted graph has a vertex subset S such that its expansion (a.k.a. conductance of S or the sparsity of the cut (S, S̄)) is bounded as follows: φ(S) def = w(S, S̄) min{w(S), w(S̄)} 6 √ 2λ2, where w is the total edge weight of a subset or a cut and λ2 is the second smallest eigenvalue of the normalized Laplacian of the graph. We study three nat...
متن کاملNew bounds for the max-k-cut and chromatic number of a graph
We consider several semidefinite programming relaxations for the max-k-cut problem, with increasing complexity. The optimal solution of the weakest presented semidefinite programming relaxation has a closed form expression that includes the largest Laplacian eigenvalue of the graph under consideration. This is the first known eigenvalue bound for the max-k-cut when k > 2 that is applicable to a...
متن کاملEigenvalue Optimization for Solving the MAX-CUT Problem
The purpose of this semester project is to investigate the Spectral Bundle Method, which is a specialized subgradient method particularly suited for solving large scale semidefinite programs that can be cast as eigenvalue optimization problems of the form min y∈R aλmax(C − m ∑ i=1 Aiyi) + b T y, where C and Ai are given real symmetric matrices, b ∈ R allows to specify a linear cost term, and a ...
متن کاملLectures 20 – 22 : Scaling limit of β - ensembles
1 Edelman-Sutton Conjecture (cont.) 1.1 Existence of eigenvalue-eigenfunction pair for the smallest eigenvalue of cH β In the last lecture, we proved ∃{f n } and a nonnegative random variable K with ||f n || 2 2 = 1, ||f n || 2 * K a.s. ∀n, so that f n , H β f n → Λ 0 = inf ||f || 2 2 =1 f ∈L * f, H β f a.s. Also, we proved the lemma: If {f n }is bounded in L * , then we can find a subsequence ...
متن کامل